Multiple Optimal Solutions in Linear Programming Models
نویسندگان
چکیده
منابع مشابه
Multiple Optimal Solutions in Quadratic Programming Models
The problem of determining whether quadratic programming models possess either unique or multiple optimal solutions is important for empirical analyses which use a mathematical programming framework. Policy recommendations which disregard multiple optimal solutions (when they exist) are potentially incorrect and less than efficient. This paper proposes a strategy and the associated algorithm fo...
متن کاملOptimal portfolios using linear programming models
The classical Quadratic Programming formulation of the well known portfolio selection problem, is cumbersome, time consuming and relies on two important assumptions: (a) the expected return is multivariate normally distributed; (b) the investor is risk averter. This paper formulates two alternative models, (i) maximin, and (ii) minimization of absolute deviation. Data from a very simple problem...
متن کاملPareto-optimal solutions in fuzzy multi-objective linear programming
The problem of solving multi-objective linear-programming problems, by assuming that the decision maker has fuzzy goals for each of the objective functions, is addressed. Several methods have been proposed in the literature in order to obtain fuzzyefficient solutions to fuzzy multi-objective programming problems. In this paper we show that, in the case that one of our goals is fully achieved, a...
متن کاملEncoding Multiple Solutions in a Linear Genetic Programming Chromosome
Linear Genetic Programming (LGP) is a Genetic Programming variant that uses linear chromosomes for solution encoding. Each LGP chromosome is a sequence of C language instructions. Each instruction has a destination variable and several source variables. One of the variables is usually chosen to provide the output of the program. In this paper, we enrich the LGP technique by allowing it to encod...
متن کاملConcept-based Summarization using Integer Linear Programming: From Concept Pruning to Multiple Optimal Solutions
In concept-based summarization, sentence selection is modelled as a budgeted maximum coverage problem. As this problem is NP-hard, pruning low-weight concepts is required for the solver to find optimal solutions efficiently. This work shows that reducing the number of concepts in the model leads to lower ROUGE scores, and more importantly to the presence of multiple optimal solutions. We addres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Agricultural Economics
سال: 1981
ISSN: 0002-9092,1467-8276
DOI: 10.2307/1241218